[Integrated Math 1 · Core Concepts ⑫-1] Principles of Counting: Addition vs. Multiplication, System Ordered Pairs, Tree Diagrams & Payment Methods

2022 Revised Curriculum · Integrated Math 1 Core Concepts ⑫-1 [Permutations & Combinations]

The Logic Behind Counting: Addition vs. Multiplication Principles, Ordered Pairs in Systems, Tree Diagrams & Payment Methods

Beyond inequalities to the foundational pillars of advanced probability: Ending brute-force enumeration via structured tree diagrams, parameter-led ordered pair branches, network paths & currency conversion techniques.

🌿 Teacher Yulcho's Storytelling: "Counting is not mere tallying; it is the architectural discipline of partitioning and linking events."
After navigating polynomials, equations, and complex inequalities, Grade 10 mathematics arrives at a profound new frontier: Combinatorics (The Principles of Counting), the engine powering modern probability, computer science, and algorithmic logic.

While elementary counting relied on counting on fingers, high school combinatorics demands structural elegance. Elite students rely on two decisive criteria: "When do we add ($+$), and when do we multiply ($\times$)?"

From tree diagrams that capture chaotic conditions without omission, to partitioning equations and inequalities by the largest coefficient, to network paths and currency conversions, let us unlock these core principles with absolute mathematical clarity!
CORE THEORY 1

Definition of Events & The Addition Principle

A repeatable experiment or observation is a 'trial', and its outcome is an 'event'.

• The Golden Rule of the Addition Principle:
If two events $A$ and $B$ are mutually exclusive (cannot occur simultaneously), and event $A$ occurs in $m$ ways while event $B$ occurs in $n$ ways:
$$\mathbf{n(A \text{ or } B) = m + n}$$ • Keywords: "or", "either", "selective alternatives" (Choosing branch $A$ completely precludes branch $B$).

• 🚨 When Events Overlap (Principle of Inclusion-Exclusion):
If events $A$ and $B$ can occur at the same time, the common outcomes ($A \cap B$) are counted twice and must be subtracted:
$$\mathbf{n(A \cup B) = n(A) + n(B) - n(A \cap B)}$$
✏️ [Model Example 1-1] Multiple Counting via Inclusion-Exclusion
Find the number of natural numbers from $1$ to $100$ that are multiples of $3$ or multiples of $5$.
View Solution & Answer (Click)
• Multiples of 3 (Set $A$): $n(A) = 100 \div 3 = 33$
• Multiples of 5 (Set $B$): $n(B) = 100 \div 5 = 20$
• Multiples of 15 (Set $A \cap B$): $n(A \cap B) = 100 \div 15 = 6$

Applying inclusion-exclusion:
$n(A \cup B) = 33 + 20 - 6 = 47$
Answer: 47
✏️ [Model Example 1-2] Ordered Pairs Satisfying $ax + by + cz = d$
Find the number of ordered triples $(x, y, z)$ of natural numbers satisfying the equation $2x + y + 3z = 15$.
💡 Teacher Yulcho's Coaching Insight: Always branch on the variable with the largest absolute coefficient ($z$) to minimize the number of cases to inspect!
View Solution & Answer (Click)
Since $x, y, z \ge 1$ are natural numbers, branch based on $z$ ($3z \le 12 \implies z \le 4$):

1) $z = 1$: $2x + y = 12$
• For $x = 1, 2, 3, 4, 5$, $y = 10, 8, 6, 4, 2 \implies 5$ pairs

2) $z = 2$: $2x + y = 9$
• For $x = 1, 2, 3, 4$, $y = 7, 5, 3, 1 \implies 4$ pairs

3) $z = 3$: $2x + y = 6$
• For $x = 1, 2$, $y = 4, 2 \implies 2$ pairs

4) $z = 4$: $2x + y = 3$
• For $x = 1$, $y = 1 \implies 1$ pair

Since these cases are mutually exclusive (Addition Rule):
$\text{Total} = 5 + 4 + 2 + 1 = 12$
Answer: 12
✏️ [Model Example 1-3] Ordered Pairs Satisfying $ax + by \le c$
Find the number of ordered pairs $(x, y)$ of natural numbers satisfying the inequality $2x + 3y \le 12$.
💡 Teacher Yulcho's Coaching Insight: Substitute natural numbers $1, 2, 3, \dots$ into the variable with the larger coefficient ($y$), transforming it into $2x \le 12 - 3y$.
View Solution & Answer (Click)
Branch on $y$ ($y \ge 1$):

1) $y = 1$: $2x + 3 \le 12 \implies 2x \le 9 \implies x \le 4.5$
Natural numbers $x \in \{1, 2, 3, 4\} \implies 4$ pairs

2) $y = 2$: $2x + 6 \le 12 \implies 2x \le 6 \implies x \le 3$
Natural numbers $x \in \{1, 2, 3\} \implies 3$ pairs

3) $y = 3$: $2x + 9 \le 12 \implies 2x \le 3 \implies x \le 1.5$
Natural numbers $x \in \{1\} \implies 1$ pair

4) $y \ge 4$: $2x + 12 \le 12 \implies 2x \le 0$ (no natural solutions)

Total ordered pairs $= 4 + 3 + 1 = 8$
Answer: 8
CORE THEORY 2

The Multiplication Principle & The Power of Tree Diagrams

When two events occur sequentially in time or pair up simultaneously in space, we apply multiplication.

• The Golden Rule of the Multiplication Principle:
If event $A$ can occur in $m$ ways, and for each of these ways event $B$ can occur in $n$ ways:
$$\mathbf{n(A \text{ and } B \text{ in succession}) = m \times n}$$ • Keywords: "and", "simultaneously", "consecutively", "followed by"

• The Systematic Power of Tree Diagrams:
When complex constraints lack simple formulas (e.g., derangements where no one receives their own item, tournament tiebreakers), a tree diagram systematically lists all possibilities without duplication or omission.
✏️ [Model Example 2-1] Distinct Terms in Polynomial Expansion
Find the number of distinct terms generated when expanding $(a + b + c)(p + q)(x + y + z + w)$.
View Solution & Answer (Click)
Since no like terms exist across the three parenthetical groups, selecting one term from each bracket produces a unique term:
• 1st bracket: 3 choices
• 2nd bracket: 2 choices
• 3rd bracket: 4 choices

$\text{Total Terms} = 3 \times 2 \times 4 = 24$
Answer: 24
✏️ [Model Example 2-2] Derangements (Tree Diagram for 4 Students)
Four students $A, B, C, D$ collect their math test papers and randomly redistribute them. Find the number of ways none of the four students receives their own test paper.
💡 Teacher Yulcho's Coaching Insight: Draw the branch where student $A$ receives paper $B$. By symmetry, multiplying that result by 3 gives the total answer!
View Solution & Answer (Click)
Assume student $A$ receives paper $B$:
• If $B$ takes $A$: $C$ takes $D$, $D$ takes $C \implies (B, A, D, C)$ (1 way)
• If $B$ takes $C$: $C$ takes $D$, $D$ takes $A \implies (B, C, D, A)$ (1 way)
• If $B$ takes $D$: $C$ takes $A$, $D$ takes $C \implies (B, D, A, C)$ (1 way)
Thus, when $A$ takes $B$, there are exactly 3 valid assignments.

By symmetry, $A$ can take $B, C,$ or $D$ (3 symmetric cases).
$\text{Total Derangements} = 3 \times 3 = 9$
Answer: 9
CORE THEORY 3

Three Benchmark Counting Models for High-Scoring Exams

Master the integration of addition and multiplication across divisors, network paths, and currency systems.

🔥 [Model 1] Number of Divisors & Divisor Sum Formula
For natural number $N = p^a \cdot q^b \cdot r^c$ (where $p, q, r$ are distinct primes):
• Number of Positive Divisors: $\mathbf{(a + 1)(b + 1)(c + 1)}$
• Sum of Positive Divisors: $\mathbf{S = (1 + p + \dots + p^a)(1 + q + \dots + q^b)(1 + r + \dots + r^c)}$
🔥 [Model 2] Road Network Counting (Addition & Multiplication Hybrid)
• (1) Mutually exclusive alternative routes $\implies$ Addition Principle
• (2) Consecutive linked path segments $\implies$ Multiplication Principle
🚨 [Model 3] Critical Benchmark: Ways to Pay vs. Distinct Amounts Paid
• Number of Ways to Pay: Product of '(Count $+ 1$)' across denominations minus $1$ (for $0$ currency).
• Number of Distinct Amounts (Overlapping Values): Convert higher denominations into smaller equivalent coins (Forced Currency Conversion) when smaller coins can fully substitute a larger bill!
✏️ [Model Example 3-1] Total and Even Divisors of 360
For natural number $360$, let $a$ be the total number of positive divisors, and let $b$ be the number of even divisors. Find $a + b$.
View Solution & Answer (Click)
$360 = 2^3 \times 3^2 \times 5$.
• $a = (3 + 1)(2 + 1)(1 + 1) = 4 \times 3 \times 2 = 24$.
• Even divisors must include at least one factor of 2 (choices: $2^1, 2^2, 2^3 \implies 3$ choices):
$b = 3 \times (2 + 1)(1 + 1) = 3 \times 3 \times 2 = 18$.
$a + b = 24 + 18 = 42$.
Answer: 42
✏️ [Model Example 3-2] Four-Point Road Network Paths
Four locations $A, B, C, D$ are connected by roads: there are 3 roads between $A$ and $B$, 4 roads between $B$ and $C$, 2 roads between $A$ and $D$, and 3 roads between $D$ and $C$. Find the number of paths from $A$ to $C$ without visiting any location more than once.
View Solution & Answer (Click)
Routes via $B$ and routes via $D$ are mutually exclusive (Addition Principle):

(i) Via $B$ ($A \to B \to C$): $3 \times 4 = 12$ ways.
(ii) Via $D$ ($A \to D \to C$): $2 \times 3 = 6$ ways.

$\text{Total Paths} = 12 + 6 = 18$.
Answer: 18
✏️ [Model Example 3-3] Payment Methods vs. Distinct Amounts
You have one 1,000-won bill, three 500-won coins, and four 100-won coins. Using some or all of this money (excluding paying 0 won), find:
(1) The number of ways to pay.
(2) The number of distinct amounts that can be paid.
View Solution & Answer (Click)
(1) Number of Ways to Pay:
$(1 + 1)(3 + 1)(4 + 1) - 1 = 2 \times 4 \times 5 - 1 = 39$ ways.

(2) Number of Distinct Amounts:
Three 500-won coins (1,500 won) can substitute for the 1,000-won bill, causing overlapping amounts.
Convert the 1,000-won bill into two 500-won coins.
Equivalent purse: five 500-won coins, four 100-won coins.
$\text{Distinct Amounts} = (5 + 1)(4 + 1) - 1 = 6 \times 5 - 1 = 29$ amounts.
Answer: (1) 39 ways, (2) 29 amounts
CRITICAL WARNING

Three Critical Pitfalls in Counting Problems

🚨 [Pitfall 1] Forgetting to Subtract 1 for Paying 0 Currency
The product $(a+1)(b+1)(c+1)$ includes the single case where zero coins/bills of all types are selected. Always verify whether the problem excludes paying 0 currency.
🚨 [Pitfall 2] Indiscriminate Currency Conversion
You must only convert a higher bill into smaller coins if the smaller coins can completely form the larger unit. If you only possess one 500-won coin, converting a 1,000-won bill creates non-existent payment values.
🚨 [Pitfall 3] Adding Non-Mutually Exclusive Events Blindly
Before adding cases, always confirm whether the events can occur at the same time. If they can overlap, subtract the intersection using the principle of inclusion-exclusion.
🌿 Teacher Yulcho's Coaching Insight
"In combinatorics, success belongs not to those who memorize formulas, but to those who possess the insight to partition events without overlap (Addition Rule) and the vision to harness symmetry into multiplication (Multiplication Rule). When these two pillars stand firm, the subsequent topics of Permutations and Combinations will unfold with total clarity."
Integrated Math 1 Core Concepts ⑫-1 complete.
Coming up next: Map coloring region partition, 3D network paths, and multi-tier currency conversion in [Integrated Math 1 · Practice Lab ⑫-1] Principles of Counting: 15 Benchmark Killers & 1:1 Twin Diagnostics!

Comments

Popular posts from this blog

Authentic Reference Models Beyond Basic Rulers

[Math Column]Studying Alongside Dedicated Peers: Becoming Each Other’s Lifelong Catalyst

[High School Math] Coordinate Geometry: 15 Essential Practice Problems on Section Formulas (Internal & External Division)